Routing and Scheduling File Transfers in Packet-switched Networks
نویسندگان
چکیده
Data traac in networks has always been dominated by le transfers, an observation that has motivated previous work in scheduling le transfers. While these previous research contributions address le transfers, they do not address the special considerations required of packet-switched networks, in particular the issues of routing and of simultaneous transmissions of les. In this paper, we generalize previous formulations of the problem to include routing and to allow for simultaneous transmissions of several les. A few theoretical results are presented.
منابع مشابه
Routing and Scheduling File Transfers in Packet-switched Networks | Appendix
THEOREM 1 If G F and G N are both bipartite, les have arbitrary lengths and links have unit speeds, then GFTS1 is NP-complete. Proof This can be proved by a simple reduction from the NP-complete Multiproces-sor Scheduling (MS) problem. In MS, we are given m 2 identical processors, and n independent jobs of lengths p 1 ; p 2 See Figure 3. It is easy to prove that there is a nonpreemptive multipr...
متن کاملOn Using Virtual-Circuit Networks for File Transfers
It has become clear that widespread collaboration in the scientific community, which can increasingly be characterized by geographically distributed and large-scale projects, requires predictable network service [1]. Predictable network service needed by applications such as large file transfers, remote visualization, and remote instrumentation can only be offered on connection-oriented network...
متن کاملProviding Quality of Service in Packet Switched Networks
Increases in bandwidths and processing capabilities of future packet switched networks will give rise to a dramatic increase in the types of applications using them. Many of these applications will require guaranteed quality of service (QOS) such as a bound on the maximum end-to-end packet delay and/or on the probability of packet loss. This poses exciting challenges to network designers. In th...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملDynamic Routing of Reliability-Differentiated Connections in Optical Burst Switched Networks
Optical burst switching (OBS) is one of the most promising nextgeneration all-optical data transport paradigms. As networks become increasingly distributed and autonomic, Optical Burst Switching becomes the right choice for the next generation optical Internet. In this paper, we propose a mechanism for Dynamic Routing of Reliability-Differentiated connections (DRRDC) in Optical Burst Switched n...
متن کامل